An iterative method for split hierarchical monotone variational inclusions
نویسندگان
چکیده
منابع مشابه
Split Monotone Variational Inclusions
Based on the very recent work by Censor-Gibali-Reich [7], we propose an extension of their new variational problem (Split Variational Inequality Problem) to monotone variational inclusions. Relying on the Krasnoselskii-Mann Theorem for averaged operators, we analyze an algorithm for solving a new split monotone inclusions under weaker conditions. Our results improve and develop previously discu...
متن کاملThe Split Hierarchical Monotone Variational Inclusions Problems and Fixed Point Problems for Nonexpansive Semigroup
The purpose of this paper is to study a split hierarchical monotone variational inclusion problem which includes split variational inequality problems, split common fixed point problems, split monotone variational inclusion problems, split convex minimization problems, etc., as special cases, and fixed point problems for nonexpansive semigroup in the setting of Hilbert spaces. For solving this ...
متن کاملImplicit Iterative Method for Hierarchical Variational Inequalities
1 Scientific Computing Key Laboratory of Shanghai Universities, Department of Mathematics, Shanghai Normal University, Shanghai 200234, China 2 Department of Mathematics, Aligarh Muslim University, Aligarh 202 002, India 3 Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia 4 Department of Applied Mathematics, National Sun Yat-se...
متن کاملA New Iterative Algorithm for Variational Inclusions with H-Monotone Operators1
In this paper, a new algorithm for solving a class of variational inclusions involving H-monotone operators is considered in Hilbert spaces. We investigate a general iterative algorithm, which consists of a resolvent operator technique step followed by a suitable projection step. We prove the convergence of the algorithm for a maximal monotone operator without Lipschitz continuity. These result...
متن کاملAsynchronous block-iterative primal-dual decomposition methods for monotone inclusions
We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the sense that, at each iteration, only a subset of the monotone operators needs to be processed, as opposed to all operators as in established methods. Determinist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Applications
سال: 2015
ISSN: 1687-1812
DOI: 10.1186/s13663-015-0368-4